PHEFT: Pessimistic Image Processing Workflow Scheduling for DSP Clusters
نویسندگان
چکیده
منابع مشابه
Application of Image Processing on DSP TMS320C6713
Face detection is a very challenging and interesting problem. In this paper, we discussed an application for automatic face detection and tracking on video streams from surveillance cameras in public or commercial places. In many situations it is useful to detect where the people are looking for, e.g. in exhibits, commercial malls, and public places in buildings. So prototype is designed to wor...
متن کاملImage Processing Workflow for the Pegasus Hale Uav Payload
The PEGASUS High-Altitude Long-Endurance (HALE) Unmanned Aerial Vehicle (UAV) system has two major operational modes: (a) large-scale regional photogrammetric and environmental mapping and (b) near real time event monitoring. Given the concept of the HALE UAV camera design (decimetre resolution RGB), a massive data stream of about 0.5 to 1.0 TB/day is expected. The Central Data Processing Centr...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملScheduling algorithms for workflow optimization
Pipelined workflows are a popular programming paradigm for parallel applications. In these workflows, the computation is divided into several stages and these stages are connected to each other through first-in first-out channels. In order to execute these workflows on a parallel machine, we must first determine the mapping of the stages onto the various processors on the machine. After finding...
متن کاملQuasi-Static Scheduling for Multiprocessor DSP
Scheduliig strategies for multiprocessor DSP are classified into four types: fully-dynamic, static-assignment, self-timed, and fully-static. The concept of static scheduling (self-timed or fullystatic) is extended to handle non-deterministic actors in the proposed quasi-static scheduling. Quasi-static scheduling minimizes run-time overhead with increased compilation complexity, thus adequate fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11050076